A full-space quasi-Lagrange-Newton-Krylov algorithm for trajectory optimization problems
نویسندگان
چکیده
منابع مشابه
Parallel Full Space SQP Lagrange-Newton-Krylov-Schwarz Algorithms for PDE-Constrained Optimization Problems
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange...
متن کاملNonlinear Preconditioning Techniques for Full-Space Lagrange-Newton Solution of PDE-Constrained Optimization Problems
The full-space Lagrange–Newton algorithm is one of the numerical algorithms for solving problems arising from optimization problems constrained by nonlinear partial differential equations. Newton-type methods enjoy fast convergence when the nonlinearity in the system is well-balanced; however, for some problems, such as the control of incompressible flows, even linear convergence is difficult t...
متن کاملParallel Lagrange-Newton-Krylov-Schur Methods for PDE-Constrained Optimization. Part I: The Krylov-Schur Solver
Large scale optimization of systems governed by partial differential equations (PDEs) is a frontier problem in scientific computation. The state-of-the-art for such problems is reduced quasi-Newton sequential quadratic programming (SQP) methods. These methods take full advantage of existing PDE solver technology and parallelize well. However, their algorithmic scalability is questionable; for c...
متن کاملNewton-Krylov Type Algorithm for Solving Nonlinear Least Squares Problems
The minimization of a quadratic function within an ellipsoidal trust region is an important subproblem for many nonlinear programming algorithms. When the number of variables is large, one of the most widely used strategies is to project the original problem into a small dimensional subspace. In this paper, we introduce an algorithm for solving nonlinear least squares problems. This algorithm i...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETNA - Electronic Transactions on Numerical Analysis
سال: 2018
ISSN: 1068-9613,1068-9613
DOI: 10.1553/etna_vol49s103